Optimal Cache-Aware Suffix Selection

A Power Aware Cache and Register File Design Space Exploration

Simple Linear Work Suffix Array Construction

A suffix array represents the suffixes of a string in sorted order. Being a simpler and more compact alternative to suffix trees, it is an important tool for full text indexing and other string processing tasks. We introduce the skew algorithm for suffix array construction over integer alphabets that can be implemented to run in linear time using integer sorting as its only nontrivial subroutin...

Study of Data Localities in Suffix-Tree Based Genetic Algorithms

This paper focuses on the study of cache localities of two genetic algorithms based on the Suffix Tree structure. As well as a description of the cache performance of the Suffix Tree.

The Transmitted Strategy of Proxy Cache Based on Segmented Video

Using proxy cache is a key technique that may help to reduce the loads of the server, network bandwidth and startup delays. Basing on the popularity of clients’ request to segment video,we extend the length for batch and patch by using dynamic cache of proxy cache for streaming media. Present transmission schemes using dynamic cache such that unicast suffix batch, unicast patch, multicast patch...

Substring Suffix Selection

We study the following substring suffix selection problem: given a substring of a string T of length n, compute its k-th lexicographically smallest suffix. This a natural generalization of the well-known question of computing the maximal suffix of a string, which is a basic ingredient in many other problems. We first revisit two special cases of the problem, introduced by Babenko, Kolesnichenko...